Adaptive Distributed Query Processing
نویسنده
چکیده
For a large-scale distributed query engine, which supports long running queries over federated data sources, it is hard to obtain statistics of data sources, servers and other resources. In addition, the characteristics of data sources and servers are changing at runtime. A traditional distributed query optimizer or centralized adaptive techniques is inadequate in this situation. In this paper, we introduce a new highly scalable distributed query processing mechanism called SwAP (Scalable & Adaptable query Processor). SwAP can quickly learn and adapt to the fluctuations of the selectivities of operations, the workload of servers, as well as the connection speed without any statistics, and accordingly change the operation order of a distributed query.
منابع مشابه
Modular Adaptive Query Processing for Service-Based Gridsa
Distributed and heterogeneous environments present significant challenges to complex software systems, which must operate in the context of continuously changing loads, with partial or out-of-date information on resource capabilities. A distributed query processor (DQP) can be used to access and integrate data from distributed sources, as well as for combining data access with data analysis. Ho...
متن کاملQuality-adaptive Query Processing
For non-collaborative data sources, both cost estimate-based optimization and quality-driven query processing are difficult to achieve because the sources do not export cost information nor data quality indicators. In this paper, we first propose an expressive query language extension using QML syntax for defining in a flexible way dimensions, metrics of data quality and data source quality. We...
متن کاملDistributed Incremental Least Mean-Square for Parameter Estimation using Heterogeneous Adaptive Networks in Unreliable Measurements
Adaptive networks include a set of nodes with adaptation and learning abilities for modeling various types of self-organized and complex activities encountered in the real world. This paper presents the effect of heterogeneously distributed incremental LMS algorithm with ideal links on the quality of unknown parameter estimation. In heterogeneous adaptive networks, a fraction of the nodes, defi...
متن کاملAdaptive Distributed Top-k Query Processing
ADiT is an adaptive approach for processing distributed topk queries over peer-to-peer networks optimizing both system load and query response time. This approach considers the size of the peer to peer network, the amount k of searched objects, the network capabilities of a connected peer, i.e. the transmission rate, the amount of objects stored on each peer, and the speed of a peer in processi...
متن کاملAdaptive Integration of Distributed Semantic Web Data
The use of RDF (Resource Description Framework) data is a cornerstone of the Semantic Web. RDF data embedded in Web pages may be indexed using semantic search engines, however, RDF data is often stored in databases, accessible via Web Services using the SPARQL query language for RDF, which form part of the Deep Web which is not accessible using search engines. This paper addresses the problem o...
متن کامل